Generalized Fano-Type Inequality for Countably Infinite Systems with List-Decoding
نویسنده
چکیده
This study investigates generalized Fano-type inequalities in the following senses: (i) the alphabet X of a random variable X is countably infinite; (ii) instead of a fixed finite cardinality of X, a fixed X-marginal distribution PX is given; (iii) information measures are generalized from the conditional Shannon entropy H(X | Y ) to a general type of conditional information measures without explicit form; and (iv) the average probability of decoding error is defined on list-decoding settings. As a result, we give tight upper bounds on such generalized conditional information measures for a fixed X-marginal, a fixed list size, and a fixed tolerated probability of error. Then, we also clarify a sufficient condition, which the Fano-type inequality is sharp, on the cardinality of the alphabet Y of a side information Y . Resulting Fano-type inequalities can apply to not only the conditional Shannon entropy but also the Arimoto’s and Hayashi’s conditional Rényi entropies, α-mutual information, and so on. Index Terms Fano’s inequality; list-decoding settings; conditional Rényi entropy; α-mutual information; majorization theory
منابع مشابه
An information diffusion Fano inequality
In this note, we present an information diffusion inequality derived from an elementary argument, which gives rise to a very general Fano-type inequality. The latter unifies and generalizes the distance-based Fano inequality and the continuous Fano inequality established in [DW13, Corollary 1, Propositions 1 and 2], as well as the generalized Fano inequality in [HV94, Equation following (10)].
متن کاملNonlinear differential equations of Riccati type on ordered Banach spaces
In this paper we consider a general class of time-varying nonlinear differential equations on infinite dimensional ordered Banach spaces, which includes as special cases many known differential Riccati equations of optimal control. Using a linear matrix inequalities (LMIs) approach we provide necessary and sufficient conditions for the existence of some global solutions such as maximal, stabili...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملOn generalized Hermite-Hadamard inequality for generalized convex function
In this paper, a new inequality for generalized convex functions which is related to the left side of generalized Hermite-Hadamard type inequality is obtained. Some applications for some generalized special means are also given.
متن کاملAlgebraic Soft-Decision Decoding of Reed-Solomon Codes Using Bit-level Soft Information
The performance of algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes using bit-level soft information is investigated. Optimal multiplicity assignment strategies (MAS) of ASD with infinite cost are first studied over erasure channels and binary symmetric channels (BSC). The corresponding decoding radii are calculated in closed forms and tight bounds on the error probability are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1801.02876 شماره
صفحات -
تاریخ انتشار 2018